Distributed Fault Diagnosis Using Consensus of Unobservable Markov Chains
نویسندگان
چکیده
A fault diagnosis procedure is proposed based on consensus in a group of local agents/experts. Local models are represented by Markov chains and modelling consensus as a mixture of these allows estimation of optimal ratings using an EM framework. To deal with the unobservable case the procedure is extended to accommodate Hidden Markov models (HMMs). Index Terms Fault diagnosis, consensus algorithm, mixtures of Markov chains, the EM algorithm, Hidden Markov Models (HMM), multi-agent systems.
منابع مشابه
Distributed Fault Detection Using Consensus of Markov Chains
We propose a fault detection procedure appropriate for use in a variety of industrial engineering contexts, which employs consensus among a group of agents about the state of a system. Markov chains are used to model subsystem behaviour, and consensus is reached by way of an iterative method based on estimates of a mixture of the transition matrices of these chains. To deal with the case where ...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملByzantine Fault Tolerance In The Distributed Environment Using Markov Chain Technique
The abstract of this paper is to tolerate the byzantine fault by providing the predefined constraints of the Nodes in the distributed environment. The nodes in the distributed environment automatically generated their constraints using Markov chain. The distributed environment predefined constraints and the member nodes predefined constraints can be updated periodically. According to this updat...
متن کاملFoundation of Diagnosis and Predictability in Probabilistic Systems
In discrete event systems prone to unobservable faults, a diagnoser must eventually detect fault occurrences. The diagnosability problem consists in deciding whether such a diagnoser exists. Here we investigate diagnosis issues in a probabilistic framework modelled by partially observed Markov chains (denoted pLTS). First we study different specifications of diagnosability and establish their r...
متن کاملLocation-Aided Fast Distributed Consensus
Existing works on distributed averaging explore linear iterations based on reversible Markov chains. The convergence of such algorithms is bounded to be slow due to the diffusive behavior of the reversible chains. It has been observed that by overcoming the diffusive behavior, certain nonreversible chains lifted from reversible ones mix substantially faster than the original chains [1], [2]. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012